منابع مشابه
Well-founded coalgebras, revisited
Theoretical models of recursion schemes have been well studied under the names well-founded coalgebras, recursive coalgebras, corecursive algebras, and Elgot algebras. Much of this work focuses on conditions ensuring unique or canonical solutions, e.g. when the coalgebra is well-founded. If the coalgebra is not well-founded, then there can be multiple solutions. The standard semantics of recurs...
متن کاملEfficient Approximation of Well-Founded Justification and Well-Founded Domination
Many native ASP solvers exploit unfounded sets to compute consequences of a logic program via some form of well-founded negation, but disregard its contrapositive, well-founded justification (WFJ), due to computational cost. However, we demonstrate that this can hinder propagation of many relevant conditions such as reachability. In order to perform WFJ with low computational cost, we devise a ...
متن کاملAdditions and Corrections to "Terminal Coalgebras in Well-founded Set Theory"
Barr, M., Additions and corrections to “Terminal coalgebras in well-founded set theory”, Theoretical Computer Science 124 (1994) 1899192. This note is to correct certain mistaken impressions of the author’s that were in the original paper, “Terminal coalgebras in well-founded set theory”, which appeared in Theoretical Computer Science 114 (1993) 299-315. While writing the original paper, I was ...
متن کاملWell-Pointed Coalgebras
For set functors preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper subobject and no proper quotient. And the initial algebra consists of all well-pointed coalgebras that are well-founded in the sense of Osius [20] and Taylor [27]. Finally, ...
متن کاملWell-Founded Semantics, Generalized
Classical fixpoint semantics for logic programs is based on the TP immediate consequence operator. The Kripke/Kleene, three-valued, semantics uses ΦP , which extends TP to Kleene’s strong three-valued logic. Both these approaches generalize to cover logic programming systems based on a wide class of logics, provided only that the underlying structure be that of a bilattice. This was presented i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2016
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129515000481